Assignment of Task Modules in Hypercube
نویسنده
چکیده
The problem of assigning task modules within a hypercube multicomputer with possible link failures is investigated. A concept of indirect optimization is introduced and a function, called communication traac, is proposed as the objective of optimization. The assignments obtained from optimizing this function are shown to signiicantly improve the actual communication performance measure, called communication turnaround time, over random assignments.
منابع مشابه
Hybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملModels for Scheduling Task Graphs onto Hypercube Systems
Given a set of m tasks with a precedence constraint P and a communication requirement C, where each task has execution time and a subcube requirement, the Hypercube Task Scheduling Problem (HTSP) is to nd an assignment of tasks which minimizes the total completion time. In this paper, we show that HTSP and its many restricted versions are NP-hard. This motivates the development of heuristic alg...
متن کاملA General Method for the Configuration of Crossbar Networks
This paper presents a general technique for embedding arbitrary communication topologies onto crossbar interconnection networks. The goal is to map the communicating modules of arbitrary parallel programs onto the processing elements of a distributed processor system connected by a crossbar interconnection network. Our method differs from those in other papers in the sense that it is a general ...
متن کاملEmbeddings in Hypercubes
One important aspect of efficient use of a hypercube computer to solve a given problem is the assignment of subtasks to processors in such a way that the communication overhead is low. The subtasks and their inter-communication requirements can be modeled by a graph, and the assignment of subtasks to processors viewed as an embedding of the task graph into the graph of the hypercube network. We...
متن کاملTransposition of Banded Matrices in Hypercubes: A Nearly Isotropic Task
A class of communication tasks, called isotropic, was introduced in [VaB92], and minimum completion time algorithms for all tasks in this class were found. Isotropic tasks are characterized by a type of symmetry with respect to origin node. In this paper we consider the problem of transposing a sparse matrix of size N x N with a diagonal band of size 2P+1 + 1, which is stored by columns in a hy...
متن کامل